On the Size Complexity of Non-Returning Context-Free PC Grammar Systems

Improving the previously known best bound, we show that any recursively enumerable language can be generated with a non-returning parallel communicating (PC) grammar system having six context-free components. We also present a non-returning universal PC grammar system generating unary languages, that is, a system where not only the number of components, but also the number of productions and the number of nonterminals are limited by certain constants, and these size parameters do not depend on the generated language

Generalized P Colony Automata and Their Relation to P Automata

We investigate genPCol automata with input mappings that can be realized through the application of finite transducers to the string representations of multisets. We show that using unrestricted programs, these automata characterize the class of recursively enumerable languages. The same holds for systems with all-tape programs, having capacity at least two. In the case of systems with com-tape programs, we show that they characterize language classes which are closely related to those characterized by variants of P automata

Playing the old tunes: a fiskean analysis of Baz Luhrmann's 2013 cinematic adaptation of the Great Gatsby

Scott Fitzgerald's The Great Gatsby has been adapted many times by different directors. However, the two prominent adaptations standing out throughout history are Jay Clayton's 1974 adaptation as the most sincere rendering of the book, and the recently adapted movie by the Broadway director, Baz Luhrmann. The latter adaptation is important in that it has been accomplished in the age of technology, in 3D format, and at the time of the new readings, i.e. cultural or new historical readings, of the novel. This paper is an endeavor to analyze the movie through John Fiske’s theory on media studies. Also, an effort has been made to see whether in this new adaptation, the idea of the new studies of the novel have been shown by the director, or else the movie is a mere representation of struggle for money discussed by the traditional Marxist scholars, metaphorically playing the old tunes

Serializing the Parallelism in Parallel Communicating Pushdown Automata Systems

We consider parallel communicating pushdown automata systems (PCPA) and define a property called known communication for it. We use this property to prove that the power of a variant of PCPA, called returning centralized parallel communicating pushdown automata (RCPCPA), is equivalent to that of multi-head pushdown automata. The above result presents a new sub-class of returning parallel communicating pushdown automata systems (RPCPA) called simple-RPCPA and we show that it can be written as a finite intersection of multi-head pushdown automata systems

On the Degree of Team Cooperation in CD Grammar Systems.

In this paper, we introduce a dynamical complexity measure, namely the degree of team cooperation, in the aim of investigating "how much" the components of a grammar system cooperate when forming a team in the process of generating terminal words. We present several results which strongly suggest that this measure is trivial in the sense that the degree of team cooperation of any language is bounded by a constant. Finally, we prove that the degree of team cooperation of a given cooperating/distributed grammar system cannot be algorithmically computed and discuss a decision problem

Passagierdampfer als Hilfskreuzer: kurze Geschichte der Entwicklung einer Schiffsgattung

To date there is no cohesive historical account of the international development of the auxiliary cruiser, and the scattered investigations of various single aspects of this ship category do not add up to a comprehensive survey. These were the circumstances discovered by the author as, upon request of the editor of this publication, he undertook to provide an introduction to the report by Captain Meyer of the only voyage of the "Kaiser Wilhelm der Grosse" as an auxiliary cruiser (see the following article). The first task was thus to gain an overall impression of this history. "Auxiliary cruisers", as defined here, were passenger steamships kept ready for battle by large shipping companies in countries with significant naval power. These ships were technically equipped for the installation of weapons, and their conversion could be carried out within a few days. The auxiliary cruiser was first to put into service by the Russians, who felt threatened by the British Royal Navy after the Russian-Turkish Balkan War. At that time a newly established shipping company, later called the "Russian Voluntary Fleet", bought three steamships from the Hamburg-America Line and had them converted for combat purposes. By the turn of the century, this originally Russian idea had been adopted by all of the world's Iarge navies . This brief study also touches on the various attempt worldwide to incorporate the legal status of the ship type "auxiliary cruiser" into international public and military law. Because of geopolitically based conflicts of interest between the naval powers, these endeavours were only partially successful. ln conclusion the author examines the auxiliary cruiser concept of the Imperial German Navy, whose goal it was to interfere with and impair the enemy's overseas commerce. The express Iiners originally designated for this purpose, however, were for various reasons inconceivably ill-suited to it. As early as 1915 the German Navy proceeded to commission cargo vessels as auxiliary cruisers, as they were inconspicuous and easier to supply. This was then the mode of operation employed by the navy during World War II

Families of languages encoded by SN P systems

[EN] In this work, we propose the study of SN P systems as classical information encoders. By taking the spike train of an SN P system as a (binary) source of information, we can obtain different languages according to a previously defined encoding alphabet. We provide a characterization of the language families generated by the SN P systems in this way. This characterization depends on the way we define the encoding scheme: bounded or not bounded and, in the first case, with one-to-one or non injective encodings. Finally, we propose a network topology in order to define a cascading encoder.Sempere Luna, JM. (2018). Families of languages encoded by SN P systems. Lecture Notes in Computer Science. 10725:262-269. https://doi.org/10.1007/978-3-319-73359-3_17S26226910725Chen, H., Freund, R., Ionescu, M., Păun, G., Pérez-Jiménez, M.J.: On string languages generated by spiking neural P systems. Fundam. Inf. 75(1–4), 141–162 (2007)Chen, H., Ionescu, M., Păun, A., Păun, G., Popa, B.: On trace languages generated by spiking neural P systems. In: Eighth International Workshop on Descriptional Complexity of Formal Systems (DCFS 2006), Las Cruces, New Mexico, USA, pp. 94–105, 21–23 June 2006Csuhaj-Varjú, E., Vaszil, G.: On counter machines versus dP automata. In: Alhazov, A., Cojocaru, S., Gheorghe, M., Rogozhin, Y., Rozenberg, G., Salomaa, A. (eds.) CMC 2013. LNCS, vol. 8340, pp. 138–150. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54239-8_11Ibarra, O.H., Leporati, A., Păun, A., Woodworth, S.: Spiking neural P systems. In: Păun, G., Rozenberg, G., Salomaa, A. (eds.) The Oxford Handbook of Membrane Computing, Oxford University Press (2010)Ionescu, M., Păun, G., Yokomori, T.: Spiking neural P systems. Fundam. Inf. 71(2–3), 279–308 (2006)Manca, V.: On the generative power of iterated transduction. In: Ito, M., Păun, G., Yu, S. (eds.) Words, Semigroups, and Transductions, pp. 315–327. World Scientific (2001)Manca, V., Martín-Vide, C., Păun, G.: New computing paradigms suggested by DNA computing: computing by carving. BioSystems 52, 47–54 (1999)Păun, G.: Membrane Computing. An Introduction. Springer, Heidelberg (2002). https://doi.org/10.1007/978-3-642-56196-2Păun, G., Pérez-Jiménez, M.J., Rozenberg, G.: Spike trains in spiking neural P systems. Int. J. Found. Comput. Sci. 17(4), 975–1002 (2006)Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol. 3. Springer, Heidelberg (1997). https://doi.org/10.1007/978-3-642-59136-

The Need for Effective Early Behavioral Family Interventions for Children with Attention Deficit Hyperactivity Disorder (ADHD)

There is a pressing need for the development of effective early family intervention programs for children showing Attention Deficit Hyperactivity Disorder (ADHD) behaviours with Conduct Disorder (CD) or Oppositional Defiant Disorder (ODD) behaviours. Previous research has indicated that children with ADHD are at risk of developing comorbid CD or ODD behaviours. In addition, it has been shown that ODD or CD behaviours in childhood tend to persist and to have adverse effects on later social adjustment. However, ODD or CD behaviours are not necessary concomitants of ADHD, and it has been demonstrated that behavioural intervention can have both short- and long term beneficial effects for children showing early signs of ODD or CD behaviours. In short term, behavioural family interventions may be able to reduce oppositional behaviour, particularly in the preschool years. In the long term, early intervention has shown to reduce the incidence of later antisocial behaviour in children at risk for this developmental trajectory. In this paper, it will be argued that behavioural family interventions have not been effectively utilised or promulgated in the community for children with ADHD despite the demonstrated efficacy of these types of interventions. A model of a multilevel system of intervention that can be tailored to the individual family’s needs is presented

The Power of Centralized PC Systems of Pushdown Automata

Parallel communicating systems of pushdown automata (PCPA) were introduced in (Csuhaj-Varj{\'u} et. al. 2000) and in their centralized variants shown to be able to simulate nondeterministic one-way multi-head pushdown automata. A claimed converse simulation for returning mode (Balan 2009) turned out to be incomplete (Otto 2012) and a language was suggested for separating these PCPA of degree two (number of pushdown automata) from nondeterministic one-way two-head pushdown automata. We show that the suggested language can be accepted by the latter computational model. We present a different example over a single letter alphabet indeed ruling out the possibility of a simulation between the models. The open question about the power of centralized PCPA working in returning mode is then settled by showing them to be universal. Since the construction is possible using systems of degree two, this also improves the previous bound three for generating all recursively enumerable languages. Finally PCPAs are restricted in such a way that a simulation by multi-head automata is possible